End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion

Knowledge graph embedding has been an active research topic for knowledge base completion, with progressive improvement from the initial TransE, TransH, DistMult et al to the current state-of-the-art ConvE. ConvE uses 2D convolution over embeddings and multiple layers of nonlinear features to model knowledge graphs. The model can be efficiently trained and scalable to large knowledge graphs. However, there is no structure enforcement in the embedding space of ConvE. The recent graph convolutional network (GCN) provides another way of learning graph node embedding by successfully utilizing graph connectivity structure. In this work, we propose a novel end-to-end Structure-Aware Convolutional Network (SACN) that takes the benefit of GCN and ConvE together. SACN consists of an encoder of a weighted graph convolutional network (WGCN), and a decoder of a convolutional network called Conv-TransE. WGCN utilizes knowledge graph node structure, node attributes and edge relation types. It has learnable weights that adapt the amount of information from neighbors used in local aggregation, leading to more accurate embeddings of graph nodes. Node attributes in the graph are represented as additional nodes in the WGCN. The decoder Conv-TransE enables the state-of-the-art ConvE to be translational between entities and relations while keeps the same link prediction performance as ConvE. We demonstrate the effectiveness of the proposed SACN on standard FB15k-237 and WN18RR datasets, and it gives about 10% relative improvement over the state-of-the-art ConvE in terms of HITS@1, HITS@3 and [email protected]: The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI 2019

Semiquantum key distribution using entangled states

Recently, Boyer et al. presented a novel semiquantum key distribution protocol [M. Boyer, D. Kenigsberg, and T. Mor, Phys. Rev. Lett. 99, 140501 (2007)], by using four quantum states, each of which is randomly prepared by Z basis or X basis. Here we present a semiquantum key distribution protocol by using entangled states in which quantum Alice shares a secret key with classical Bob. We also show the protocol is secure against eavesdropping.Comment: 6 page

Quantum secure communication scheme with W state

Recently, Cao et al. proposed a new quantum secure direct communication scheme using W state. In their scheme, the error rate introduced by an eavesdropper who takes intercept-resend attack, is only 8.3%. Actually, their scheme is just a quantum key distribution scheme because the communication parties first create a shared key and then encrypt the secret message using one-time pad. We then present a quantum secure communication scheme using three-qubit W state. In our scheme, the error rate is raised to 25% and it is not necessary for the present scheme to use alternative measurement or Bell basis measurement. We also show our scheme is unconditionally secure.Comment: Comments are welcom

Bis[2,4-dichloro-6-(ethyl­imino­meth­yl)phenolato-κ2 N,O]nickel(II)

In the title compound, [Ni(C9H8Cl2NO)2], the NiII ion lies on an inversion centre and is coordinated in a slightly distorted square-planar geometry by an N and an O atom from two symmetry-related bidentate 2,4-dichloro-6-(ethyl­imino­meth­yl)phenolate ligands. In the crystal structure, there are short Cl⋯Cl distances of 3.506 (1) and 3.350 (1) Å